#include<bits/stdc++.h>
using namespace std;
queue<int>q;
int n,ans,a[100500];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;ans=n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)
    {
        if(!q.empty()&&q.front()<a[i])
        {
            q.pop();
            q.push(a[i]);
            ans--;
        }
        else q.push(a[i]);
    }
    cout<<ans;
    return 0;
}
